منابع مشابه
Mobile vs. point guards
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using “rectangular vision”. We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Further...
متن کاملHidden Mobile Guards in Simple Polygons
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question: does a specific type of polygon admit some guard set? Types include simple polygons and the subclasses of orthogonal, monotone, and starshaped polygons. Add...
متن کاملIntroduction to the Prisoners versus Guards Game
Suppose that you are competing in a two-player game in which you and your opponent attempt to pack as many “prisoners” as possible on the squares of an n×n checkerboard; each prisoner has to be “protected” by an appropriate number of guards. Initially, the board is covered entirely with guards. The players – designated as “red” and “blue” – take turns adjusting the board configuration using one...
متن کاملPoint-to-Point versus Mobile Wireless Communication Channels 1.1 BANDPASS MODEL FOR POINT-TO-POINT COMMUNICATIONS
Most point-to-point communication links (e.g., the telephone line channel, fixed microwave channels, etc.) are well-modeled using a bandpass additive noise system model of the form shown in Figure 1.1. All the signals in this model are written with “tildas” which will be dropped in the complex baseband representation of the following section. A more detailed description of the link model is as ...
متن کاملGuarding curvilinear art galleries with vertex or point guards
One of the earliest and most well known problems in computational geometry is the socalled art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2018
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-018-9996-x